Minimizing restricted-fanout queries

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Restricted-Fanout Queries

Sagiv, Y. and Y. Saraiya, Minimizing restricted-fanout queries, Discrete Applied Mathematics 40 ( 1992) 2455264. Conjunctive queries form an important subset of relational algebra. Each conjunctive query has a unique minimum equivalent (up to isomorphism). However, the computation of the minimum equivalent is complete for co-. u% Johnson and Klug have proposed a subclass of conjunctive queries,...

متن کامل

Minimizing Statistical Bias with Queries

I describe a querying criterion that attempts to minimize the error of a learner by minimizing its estimated squared bias. I describe experiments with locally-weighted regression on two simple problems, and observe that this "bias-only" approach outperforms the more common "variance-only" exploration approach, even in the presence of noise.

متن کامل

Taming XPath Queries by Minimizing Wildcard Steps

This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called the layer axis, to rewrite a sequence of XPath steps (all of which are wildcard steps except for possibly the last) into a single layer-axis step. We describe an efficient implementation of the layer axis and present ...

متن کامل

Variable Fanout

Data compression attempts to reduce the amount of information needed to recreate a signal. A source coder is a data compression system which attempts to maximize the quality of the signal reproduction for a xed transmission rate or minimize the transmission rate for a xed reproduction quality. Source coders are designed by exploiting the statistics of their signal sources. A vector quantizer ca...

متن کامل

Restricted Information from Nonadaptive Queries to NP

We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted information such as the number of queries that are in the oracle set or even just this number modulo m, for some m 2. We also investigate the case in which evaluators are nondeterministic. We show that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1992

ISSN: 0166-218X

DOI: 10.1016/0166-218x(92)90032-6